A uniform solution to SAT using membrane creation
نویسندگان
چکیده
منابع مشابه
A uniform solution to SAT using membrane creation
In living cells, new membranes are produced basically through two processes: mitosis and autopoiesis. These two processes have inspired two variants of cell-like membrane systems, namely P systems with active membranes and P systems with membrane creation. In this paper, we provide the first uniform, efficient solution to the SAT problem in the framework of recogniser P systems with membrane cr...
متن کاملURSA: A System for Uniform Reduction to SAT
There are a huge number of problems, from various areas, being solved by reducing them to sat. However, for many applications, translation into sat is performed by specialized, problem-specific tools. In this paper we describe a new system for uniform solving of a wide class of problems by reducing them to sat. The system uses a new specification language ursa that combines imperative and decla...
متن کاملUniform Solution to QSAT Using Polarizationless Active Membranes
1 Research Group on Mathematical Linguistics Rovira i Virgili University Pl. Imperial Tarraco 1, 43005 Tarragona, Spain [email protected] 2 Institute of Mathematics and Computer Science Academy of Sciences of Moldova Str. Academiei 5, Chişinău, MD 2028, Moldova [email protected] 3 Research Group on Natural Computing Department of Computer Science and Artificial Intelligence Univer...
متن کاملKernel modeling for molecular surfaces using a uniform solution
In this paper, a rational Bézier surface is proposed as a uniform approach to modeling all three types of molecular surfaces (MS): the van der Waals surface (vdWS), solvent accessible surface (SAS) and solvent excluded surface (SES). Each molecular surface can be divided into molecular patches, which can be defined by their boundary arcs. The solution consists of three steps: topology modeling,...
متن کاملUniform Solution Sampling Using a Constraint Solver As an Oracle
We consider the problem of sampling from solutions defined by a set of hard constraints on a combinatorial space. We propose a new sampling technique that, while enforcing a uniform exploration of the search space, leverages the reasoning power of a systematic constraint solver in a black-box scheme. We present a series of challenging domains, such as energy barriers and highly asymmetric space...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2007
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2006.10.013